Efficient Calculation of Personalized Document Rankings
نویسندگان
چکیده
Social networks allow users getting personalized recommendations for interesting resources like websites or scientific papers by using reviews of users they trust. Search engines rank documents by using the reference structure to compute a visibility for each document with reference structure-based functions like PageRank. Personalized document visibilities can be computed by integrating both approaches. We present a framework for incorporating the information from both networks, and ranking algorithms using this information for personalized recommendations. Because the computation of document visibilities is costly and therefore cannot be done in runtime, i.e., when a user searches a document repository, we pay special attention to develop algorithms providing an efficient calculation of personalized visibilities at query time based on precalculated global visibilities. The presented ranking algorithms are evaluated by a simulation study.
منابع مشابه
Information Retrieval in Trust-Enhanced Document Networks
To fight the problem of information overload in huge information sources like large document repositories, e. g. citeseer, or internet websites you need a selection criteria: some kind of ranking is required. Ranking methods like PageRank use the document reference network structure. However, these rankings do not distinguish different reference semantics. We enhance these rankings by incorpora...
متن کاملMining User Dwell Time for Personalized Web Search Re-Ranking
We propose a personalized re-ranking algorithm through mining user dwell times derived from a user’s previously online reading or browsing activities. We acquire document level user dwell times via a customized web browser, from which we then infer concept word level user dwell times in order to understand a user’s personal interest. According to the estimated concept word level user dwell time...
متن کاملCommunity Detection Using Time-Dependent Personalized PageRank
Local graph diffusions have proven to be valuable tools for solving various graph clustering problems. As such, there has been much interest recently in efficient local algorithms for computing them. We present an efficient local algorithm for approximating a graph diffusion that generalizes both the celebrated personalized PageRank and its recent competitor/companion the heat kernel. Our algor...
متن کاملEffect of Velocity and Direction of Airflow on Thermal Comfort and Energy Consumption: Case of New Exclusive Cooling Systems
The application of personalized ventilation systems, particularly in the buildings, is one of the new topics that today presented to it, because of their proper performance in reducing energy consumption and creating better thermal comfort conditions. In the current study, the energy consumption of a personalized cooling system installed in a room, considering the constraint of thermal comfort,...
متن کاملPersonalized Document Rankings by Incorporating Trust Information From Social Network Data into Link-Based Measures
Recently, two-layer approaches that integrate information from social networks into link-based measures on document reference networks such as the web, scientific publications or wikis gained much attention. In this paper, we extend the framework presented in [1] in order to achieve a stronger personalization of the document recommendations. Therefore, we investigate alternative approaches for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007